A Morphing with Geometric Continuity between Two Arbitrary Planar Polygons
نویسندگان
چکیده
This paper introduces the geometric continuity equations of the closed planar polygons and gives the definition of a morphing with geometric continuity between two arbitrary planar polygons, including simple, non-3 and even degenerated polygons. A simple morphing technique based on linear interpolation of the geometric continuity equations is proposed. The closureness of the in-between polygons is precisely achieved. Two global invariants: rotation indexes and winding numbers are introduced to describe the most general polygons. The demo shows that this technique is efficient and natural for morphing between polygons with arbitrary rotation indexes and winding numbers.
منابع مشابه
Feature-based 3D morphing based on geometrically constrained spherical parameterization
Current trends in free form editing motivate the development of a novel editing paradigm for CAD models beyond traditional CAD editing of mechanical parts. To this end, we need robust and efficient 3D mesh deformation techniques such as 3D structural morphing. In this paper, we present a feature-based approach to 3D morphing of arbitrary genus-0 polyhedral objects that is appropriate for CAD ed...
متن کاملPolygon Morphing Using a M ultiresolution Representation
We present an algorithm for morphing between two simple polygons . The two polygons are converted to mul tiresolu tion representations. Intermediate representations are generated from these two, from which intermediate polygons are reconstructed. Our algorit.hm is simpler than the few existing polygon morphing schemes, and its results compare favorably. The key to the success of our algorithm i...
متن کاملGuaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کاملGeometric conditions for tangent continuity of interpolatory planar subdivision curves
Curve subdivision is a technique for generating smooth curves from initial control polygons by repeated refinement. The most common subdivision schemes are based on linear refinement rules, which are applied separately to each coordinate of the control points, and the analysis of these schemes is well understood. Since the resulting limit curves are not sufficiently sensitive to the geometry of...
متن کاملA new core-based morphing algorithm for polygons
Morphing is a process of shape transformation between two objects. This paper focuses on morphing of simple polygons. In general, the key part of most morphing methods is to find correspondence between vertices of both objects. We present a new algorithm trying to avoid this step. Using an idea of intersection of two polygons (called core) the problem of morphing polygons is decomposed to sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002